Curvature computations for n-manifolds in Rn+m and solution to an open problem proposed by R. Goldman
نویسندگان
چکیده
In this paper, simple and explicit formulas for computing mean curvature vector and Gauss–Kronecker curvature for n-manifolds in Rn+m are derived. Using these formulas, we solve an open problem, proposed by Ron Goldman, about curvature formulas for implicit surfaces with higher co-dimensions. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Conformal mappings preserving the Einstein tensor of Weyl manifolds
In this paper, we obtain a necessary and sufficient condition for a conformal mapping between two Weyl manifolds to preserve Einstein tensor. Then we prove that some basic curvature tensors of $W_n$ are preserved by such a conformal mapping if and only if the covector field of the mapping is locally a gradient. Also, we obtained the relation between the scalar curvatures of the Weyl manifolds r...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملACTION OF SEMISIMPLE ISOMERY GROUPS ON SOME RIEMANNIAN MANIFOLDS OF NONPOSITIVE CURVATURE
A manifold with a smooth action of a Lie group G is called G-manifold. In this paper we consider a complete Riemannian manifold M with the action of a closed and connected Lie subgroup G of the isometries. The dimension of the orbit space is called the cohomogeneity of the action. Manifolds having actions of cohomogeneity zero are called homogeneous. A classic theorem about Riemannian manifolds...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 24 شماره
صفحات -
تاریخ انتشار 2007